Parsing with Su x and Pre x
نویسندگان
چکیده
We show that greedy left-to-right (right-to-left) parsing is optimal w.r.t. a suux (preex) dictionary. To exploit this observation, we show how to construct a static suux dictionary that supports on-line, linear-time optimal parsing. From this we derive an adaptive on-line method that yields compression comparing favorably to LZW.
منابع مشابه
Assessment of bone mineral density with dual energy X-ray absorptiometry in pre- and post-menopausal women
Background: Osteoporosis is a chronic disease that contributes substantially to decrease physical activity and decline in the quality of life. Osteoporosis can be diagnosed easily with the use of dual-energy X-ray absorptiometry (DXA) equipment. The aim of this study was to investigate the magnitude of bone loss on proximal femur and lumbar spine LS in pre- and post-menopausal women f...
متن کاملComplete Variable-Length "Fix-Free" Codes
A set of codewords is x free if it is both pre x free and su x free no codeword in the set is a pre x or a su x of any other A set of codewords fx x xng over a t letter alphabet is said to be complete if it satis es the Kraft inequality with equality so that X
متن کاملتأثیر ساخت‌واژه‌ها در تجزیه وابستگی زبان فارسی
Data-driven systems can be adapted to different languages and domains easily. Using this trend in dependency parsing was lead to introduce data-driven approaches. Existence of appreciate corpora that contain sentences and theirs associated dependency trees are the only pre-requirement in data-driven approaches. Despite obtaining high accurate results for dependency parsing task in English langu...
متن کاملcient Decoding of Pre x Codes
We discuss representations of pre x codes and the corresponding storage space and decoding time requirements. We assume that a dictionary of words to be encoded has been de ned and that a pre x code appropriate to the dictionary has been constructed. The encoding operation becomes simple given these assumptions and given an appropriate parsing strategy, therefore we concentrate on decoding. The...
متن کاملk-p-Infix codes and semaphore codes
In this paper we introduce the concepts of k-p-in x codes, n-k-ps-in x languages, n-k-in xout x codes, and n-k-pre x-su x languages, which are natural generalizations of our previous work on k-pre x codes, k-in x codes and so on. We obtain several properties of k-p-in x codes and semaphore codes. The relations and hierarchies of k-p-in x codes, n-k-ps-languages, and n-kpre x-su x languages, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996